By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 19, Issue 1, pp. 1-501

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Error Bounds in Metric Spaces and Application to the Perturbation Stability of Metric Regularity

Huynh Van Ngai and Michel Théra

pp. 1-20

BibTeX  Abstract Full Text:  PDF

Branch-and-Cut for the Maximum Feasible Subsystem Problem

Marc E. Pfetsch

pp. 21-38

BibTeX  Abstract Full Text:  PDF

Lagrangian-Dual Functions and Moreau–Yosida Regularization

Fanwen Meng, Gongyun Zhao, Mark Goh, and Robert De Souza

pp. 39-61

BibTeX  Abstract Full Text:  PDF

Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces

Xi Yin Zheng and Kung Fu Ng

pp. 62-76

BibTeX  Abstract Full Text:  PDF

Relaxation-Based Bounds for Semi-Infinite Programs

Alexander Mitsos, Panayiotis Lemonidis, Cha Kun Lee, and Paul I. Barton

pp. 77-113

BibTeX  Abstract Full Text:  PDF

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

Florian A. Potra

pp. 114-143

BibTeX  Abstract Full Text:  PDF

Dual Characterization and Scalarization for Benson Proper Efficiency

Jing-Hui Qiu

pp. 144-162

BibTeX  Abstract Full Text:  PDF

Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization

Chong Li, K. F. Ng, and T. K. Pong

pp. 163-187

BibTeX  Abstract Full Text:  PDF

Multiobjective Optimization Through a Series of Single-Objective Formulations

Charles Audet, Gilles Savard, and Walid Zghal

pp. 188-210

BibTeX  Abstract Full Text:  PDF

Well Posed Optimization Problems and Nonconvex Chebyshev Sets in Hilbert Spaces

Francesca Faraci and Antonio Iannizzotto

pp. 211-216

BibTeX  Abstract Full Text:  PDF

Regularity Conditions via Quasi-Relative Interior in Convex Programming

Radu Ioan Bot, Ernö Robert Csetnek, and Gert Wanka

pp. 217-233

BibTeX  Abstract Full Text:  PDF

A Short Algebraic Proof of the Farkas Lemma

David Bartl

pp. 234-239

BibTeX  Abstract Full Text:  PDF

A Class of Inexact Variable Metric Proximal Point Algorithms

L. A. Parente, P. A. Lotito, and M. V. Solodov

pp. 240-260

BibTeX  Abstract Full Text:  PDF

A Condition Number for Multifold Conic Systems

Dennis Cheung, Felipe Cucker, and Javier Peña

pp. 261-280

BibTeX  Abstract Full Text:  PDF

A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization

P. Apkarian, D. Noll, and O. Prot

pp. 281-306

BibTeX  Abstract Full Text:  PDF

A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians

Andrea Walther

pp. 307-325

BibTeX  Abstract Full Text:  PDF

Global Convergence of a Nonsmooth Newton Method for Control-State Constrained Optimal Control Problems

Matthias Gerdts

pp. 326-350

BibTeX  Abstract Full Text:  PDF

An Inexact SQP Method for Equality Constrained Optimization

Richard H. Byrd, Frank E. Curtis, and Jorge Nocedal

pp. 351-369

BibTeX  Abstract Full Text:  PDF

Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming

Zi Xian Chan and Defeng Sun

pp. 370-396

BibTeX  Abstract Full Text:  PDF

Convergence of New Inertial Proximal Methods for DC Programming

Paul-Emile Maingé and Abdellatif Moudafi

pp. 397-413

BibTeX  Abstract Full Text:  PDF

Recursive Trust-Region Methods for Multiscale Nonlinear Optimization

Serge Gratton, Annick Sartenaer, and Philippe L. Toint

pp. 414-444

BibTeX  Abstract Full Text:  PDF

On the Global Solution of Linear Programs with Linear Complementarity Constraints

Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin P. Bennett, and Gautam Kunapuli

pp. 445-471

BibTeX  Abstract Full Text:  PDF

Embedded in the Shadow of the Separator

Frank Göring, Christoph Helmberg, and Markus Wappler

pp. 472-501

BibTeX  Abstract Full Text:  PDF